On partitions of hereditary properties of graphs
نویسندگان
چکیده
In this paper a concept Q-Ramsey Class of graphs is introduced, where Q is a class of bipartite graphs. It is a generalization of wellknown concept of Ramsey Class of graphs. Some Q-Ramsey Classes of graphs are presented (Theorem 1 and 2). We proved that T 2, the class of all outerplanar graphs, is not D1-Ramsey Class (Theorem 3). This results leads us to the concept of acyclic reducible bounds for a hereditary property P. For T 2 we found two bounds (Theorem 4). An improvement, in some sense, of that in Theorem 5 is given.
منابع مشابه
k-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملHereditary properties of partitions, ordered graphs and ordered hypergraphs
In this paper we use the Klazar-Marcus-Tardosmethod (see [22]) to prove that if a hereditary property of partitions P has super-exponential speed, then for every k-permutation π, P contains the partition of [2k] with parts {{i, π(i) + k} : i ∈ [k]}. We also prove a similar jump, from exponential to factorial, in the possible speeds of monotone properties of ordered graphs, and of hereditary pro...
متن کاملTsallis Entropy and Conditional Tsallis Entropy of Fuzzy Partitions
The purpose of this study is to define the concepts of Tsallis entropy and conditional Tsallis entropy of fuzzy partitions and to obtain some results concerning this kind entropy. We show that the Tsallis entropy of fuzzy partitions has the subadditivity and concavity properties. We study this information measure under the refinement and zero mode subset relations. We check the chain rules for ...
متن کاملOn Growth Rates of Permutations, Set Partitions, Ordered Graphs and Other Objects
For classes O of structures on finite linear orders (permutations, ordered graphs etc.) endowed with containment order (containment of permutations, subgraph relation etc.), we investigate restrictions on the function f(n) counting objects with size n in a lower ideal in (O, ). We present a framework of edge P -colored complete graphs (C(P ), ) which includes many of these situations, and we pr...
متن کامل21 st British Combinatorial Conference University of Reading 9 th - 13 th July 2007
A hereditary property of graphs is a collection of (isomorphism classes of) graphs which is closed under taking induced graphs, and contains arbitrarily large structures. Given a family F of graphs, the family P(F) of graphs containing no member of F as an induced subgraph is a hereditary property, and every hereditary property of graphs arises in this way. A hereditary property of other combin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 26 شماره
صفحات -
تاریخ انتشار 2006